Scoring Algorithm for Context-Sensitive HMMs with Application to RNA Secondary Structure Analysis

نویسندگان

  • Byung-Jun Yoon
  • P. P. Vaidyanathan
چکیده

During the last decade, a number of evidences have been found that non-coding RNAs (ncRNA) are involved in various important processes. Many of these ncRNAs are known to conserve their secondary structure, which gives rise to complex dependencies between distant bases in the primary sequence. Therefore, we need more complex models than the traditional HMM in order to analyze ncRNAs. Recently, contextsensitive HMMs (csHMM) have been proposed for modeling RNA secondary structures. In this paper, we propose a dynamic programming algorithm that can be used for scoring csHMMs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An evolutionary algorithm for stochastic context-free grammar design, with applications to RNA secondary structure prediction

Stochastic Context-Free Grammars (SCFGs) have been used widely in modelling RNA secondary structure. They were motivated by the use of Hidden Markov Models (HMMs) in protein modelling (Krogh et al., (1993)). What was lacking in HMMs though, was the ability to model long range interactions which are necessary to provide an effective model for RNA secondary structure. Thus, SCFGs, as generalisati...

متن کامل

A Genetic Algorithm for Grammars

Ribonucleic acid (RNA) secondary structure prediction is an important problem in molecular biology; almost as soon as RNA started to be sequenced, methods have been established to determine the structure from the sequence of nucleotides. From the secondary structure one can start to find the function of a given RNA molecule, which is of course important in understanding how the cell works, char...

متن کامل

Recent Methods for RNA Modeling Using Stochastic Context-Free Grammars

Stochastic context-free grammars (SCFGs) can be applied to the problems of folding, aligning and modeling families of homologous RNA sequences. SCFGs capture the sequences' common primary and secondary structure and generalize the hidden Markov models (HMMs) used in related work on protein and DNA. This paper discusses our new algorithm, Tree-Grammar EM, for deducing SCFG parameters automatical...

متن کامل

HMM sampling and applications to gene finding and alternative splicing

The standard method of applying hidden Markov models to biological problems is to find a Viterbi (maximal weight) path through the HMM graph. The Viterbi algorithm reduces the problem of finding the most likely hidden state sequence that explains given observations, to a dynamic programming problem for corresponding directed acyclic graphs. For example, in the gene finding application, the HMM ...

متن کامل

PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars

Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005